NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
871	Name Date[removed]key # 1) Sudoku Puzzle Add to Reading List Source URL: www.edhelperclipart.com Language: English - Date: 2005-09-26 11:52:33 Games Sudoku NP-complete problems Puzzle video games Mathematics of Sudoku Sudoku algorithms Logic puzzles Mathematics Recreational mathematics
872	Huck Bennett Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer Street New York, NY Add to Reading List Source URL: www.cims.nyu.edu Language: English - Date: 2014-09-05 13:35:53 Association of American Universities North Central Association of Colleges and Schools Geography of Colorado NP-complete problems Logic in computer science Boolean satisfiability problem Boulder Colorado Satisfiability University of Colorado at Boulder Association of Public and Land-Grant Universities Theoretical computer science Colorado counties
873	Research Statement He Sun My research area is at the interface between Algorithm Design and Complexity Theory. Within these general areas, my main research interests are sublinear algorithms, Markov processes, and distri Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-05-09 07:53:49 Connectivity Gossip protocol Graph coloring Randomized algorithm NP-complete problems Distributed computing Algorithm Minimum spanning tree Clique Theoretical computer science Mathematics Graph theory
874	Approximation Algorithms for Finding Maximum Independent Sets in Unions of Perfect Graphs Authors: Chakaravarthy, Pandit, Roy, Sabharwal Speaker: Arindam Pal Department of Computer Science and Engineering Indian Institut Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2012-12-01 01:44:16 Comparability graph Perfect graph Clique Independent set Graph coloring Trivially perfect graph Path decomposition Graph theory NP-complete problems Chordal graph
875	On Triangulation-based Dense Neighborhood Graph Discovery Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H. Tung ∗ School of Computing, National University of Singapore, Singapore {wangnan, Add to Reading List Source URL: www.vldb.org Language: English - Date: 2010-11-18 12:59:50 Graph Graph operations NP-complete problems Connectivity Line graph Degeneracy Graph theory Clique Neighbourhood
876	Independent dominating sets in graphs of girth five Ararat Harutyunyan∗ Paul Horn† Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2010-09-24 16:29:59 NP-complete problems Dominating set Weight Graph coloring Graph theory Theoretical computer science Mathematics
877	cc.complexity theory - Restriction of Exact Cover by 3-sets - Theoretical Computer Science Stack Exchange Add to Reading List Source URL: www.nearly42.org Language: English - Date: 2014-01-11 18:13:39 Exact cover Theoretical computer science Computer science Computational complexity theory NP-complete NP-complete problems Applied mathematics Mathematics
878	Yet Harder Knapsack ProblemsI Stasys Jukna∗,1 Georg Schnitger University of Frankfurt, Institut of Computer Science, DFrankfurt, Germany. Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2011-10-21 09:58:40 Computational complexity theory Combinatorial optimization NP-complete problems Cryptography Dynamic programming Knapsack problem Branch and bound Optimization problem Backtracking Operations research Theoretical computer science Applied mathematics
879	A Computer System for Building Community Bys pickyp Roytes. The paper describes a computer program being deueloped by the Western Rustrallan Department of Transport that solues the Traueling Salesman Problem. There are Add to Reading List Source URL: www.atrf.info Language: English - Date: 2011-12-21 20:21:54 NP-complete problems Operations research Travelling salesman problem Combinatorial optimization Heuristic function Heuristic Pickup A* search algorithm Theoretical computer science Mathematics Computational complexity theory
880	Currently under second review in European Journal of Operational Research CHARACTERIZING SEARCH SPACES FOR TABU SEARCH Christopher R. Houck, Jeffrey A. Joines, Michael G. Kay Department of Industrial Engineering, North Add to Reading List Source URL: aiinfinance.com Language: English - Date: 2012-06-26 15:09:54 Theoretical computer science Mathematical optimization Heuristics Search algorithms NP-complete problems Genetic algorithm Tabu search Travelling salesman problem Heuristic function Applied mathematics Mathematics Operations research

UPDATE